Regional Gossip Routing for Wireless Ad Hoc Networks
نویسندگان
چکیده
منابع مشابه
Regional Gossip Routing for Wireless Ad Hoc Networks
Many routing protocols have been proposed for wireless ad hoc networks, and most of them are based on some variants of flooding. Thus many routing messages are propagated through the network unnecessarily despite various optimizations. Gossip based routing method has been used and re-investigated to reduce the number of messages in both wired networks and wireless ad hoc networks. However, the ...
متن کاملLEBRP - A Lightweight and Energy Balancing Routing Protocol for Energy-Constrained Wireless Ad Hoc Networks
A wireless ad hoc network typically refers to any set of wireless networks where all devices have equal status on a network and are free to associate with any other wireless ad hoc network devices in their range. As the nature of these networks, they commonly do not have external power supplies, and each node has a limited internal power source. In this paper, we put forward a new routing proto...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملGossip Based Routing Protocol Design for Ad Hoc Networks
A spontaneously mannered decentralized network with no formal infrastructure and limited in temporal and spatial extent where each node communicate with each other over a wireless channel and is willing to forward data for other nodes is called as Wireless Ad Hoc network. In this research study, we proposed a routing strategy based on gossip based routing approach that follows the proactive rou...
متن کاملLocalized routing for wireless ad hoc networks
We show that, given a set of randomly distributed wireless nodes with density n, when the transmission range rn of wireless nodes satis£es πr n ≥ 3 log n+c(n) n , the localized Delaunay triangulation (LDel) [1] is the same as the Delaunay triangulation with high probability, where c(n) → ∞ as n goes in£nity. Our experiments show that the delivery rates of existing localized routing protocols ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mobile Networks and Applications
سال: 2005
ISSN: 1383-469X
DOI: 10.1023/b:mone.0000048546.90440.0d